Sakharov defeated by "odd arithmetic"
نویسندگان
چکیده
منابع مشابه
The Arithmetic of Even-Odd Trees
Even-Odd Trees are a canonical tree-based number representation derived from a bijection between trees defined by the data type equation T = 1 + T ∗ T ∗ + T ∗ T ∗ and positive natural numbers seen as iterated applications of o(x) = 2x and i(x) = 2x+ 1 Starting from 1. This paper introduces purely functional arithmetic algorithms for operations on Even-Odd Trees. While within constant factors fr...
متن کاملArithmetic Properties of Overpartitions into Odd Parts
In this article, we consider various arithmetic properties of the function po(n) which denotes the number of overpartitions of n using only odd parts. This function has arisen in a number of recent papers, but in contexts which are very different from overpartitions. We prove a number of arithmetic results including several Ramanujan-like congruences satisfied by po(n) and some easily-stated ch...
متن کاملEfficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics
In elliptic curve cryptosystems, scalar multiplications performed on the curves have much effect on the efficiency of the schemes, and many efficient methods have been proposed. In particular, recoding methods of the scalars play an important role in the performance of the algorithm used. For integer radices, non-adjacent form (NAF) and its generalizations (e.g., generalized non-adjacent form (...
متن کاملArithmetic of Linear Forms Involving Odd Zeta Values
A general hypergeometric construction of linear forms in (odd) zeta values is presented. The construction allows to recover the records of Rhin and Viola for the irrationality measures of ζ(2) and ζ(3), as well as to explain Rivoal’s recent result on infiniteness of irrational numbers in the set of odd zeta values, and to prove that at least one of the four numbers ζ(5), ζ(7), ζ(9), and ζ(11) i...
متن کاملArithmetic Properties of Overpartition Pairs into Odd Parts
In this work, we investigate various arithmetic properties of the function ppo(n), the number of overpartition pairs of n into odd parts. We obtain a number of Ramanujan type congruences modulo small powers of 2 for ppo(n). For a fixed positive integer k, we further show that ppo(n) is divisible by 2 k for almost all n. We also find several infinite families of congruences for ppo(n) modulo 3 a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1989
ISSN: 0028-0836,1476-4687
DOI: 10.1038/337293a0